Approximate Nearest Neighbor Search in ℓp
نویسنده
چکیده
We present a new locality sensitive hashing (LSH) algorithm for c-approximate nearest neighbor search in `p with 1 < p < 2. For a database of n points in `p, we achieve O(dn) query time and O(dn + n1+ρ) space, where ρ ≤ O((ln c)2/cp). This improves upon the previous best upper bound ρ ≤ 1/c by Datar et al. (SOCG 2004), and is close to the lower bound ρ ≥ 1/c by O’Donnell, Wu and Zhou (ITCS 2011). The proof is a simple generalization of the LSH scheme for `2 by Andoni and Indyk (FOCS 2006).
منابع مشابه
EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph
Approximate nearest neighbor (ANN) search is a fundamental problem in many areas of data mining, machine learning and computer vision. The performance of traditional hierarchical structure (tree) based methods decreases as the dimensionality of data grows, while hashing based methods usually lack efficiency in practice. Recently, the graph based methods have drawn considerable attention. The ma...
متن کاملNearest Neighbor Search using Kd-trees
We suggest a simple modification to the kd-tree search algorithm for nearest neighbor search resulting in an improved performance. The Kd-tree data structure seems to work well in finding nearest neighbors in low dimensions but its performance degrades even if the number of dimensions increases to more than three. Since the exact nearest neighbor search problem suffers from the curse of dimensi...
متن کاملApproximate nearest neighbor search for $\ell_p$-spaces ($2<p<\infty$) via embeddings
While the problem of approximate nearest neighbor search has been well-studied for Eu-clidean space and ℓ 1 , few non-trivial algorithms are known for ℓ p when 2 < p < ∞. In this paper, we revisit this fundamental problem and present approximate nearest-neighbor search algorithms which give the first non-trivial approximation factor guarantees in this setting.
متن کاملImplementing a Parallel Dynamic Approximate Nearest Neighbor Search Algorithm∗
We describe the implementation of a fast, dynamic, approximate, nearest-neighbor search algorithm that works well in fixed dimensions (d ≤ 5), based on sorting points coordinates in Morton (or z-) ordering. Our code scales well on multi-core/cpu shared memory systems. Our implementation is competitive with the best approximate nearest neighbor searching codes available on the web, especially fo...
متن کاملDerivation of Theoretical Formulas of Accuracy on Accessing Neighboring Buckets in Hash-Based Approximate Nearest Neighbor Search
Approximate nearest neighbor search is a technique which greatly reduces processing time and required amount of memory. Generally, there are the relationships of trade-off among accuracy, processing time and memory amount. Therefore, analysis on the relationships is an important task for practical application of the approximate nearest neighbor search method. In this paper, we construct a model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1306.3601 شماره
صفحات -
تاریخ انتشار 2013